Enumerating anchored permutations with bounded gaps
نویسندگان
چکیده
منابع مشابه
Enumerating Pattern Avoidance for Affine Permutations
In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in S̃n that avoid p if and only if p avoids the pattern 321. We then count the number of affine permutations that avoid a given pattern p for each p in S3, as well as give some conjectures for the patterns in S4.
متن کاملEnumerating rc-Invariant Permutations with No Long Decreasing Subsequences∗
We use the Robinson-Schensted-Knuth correspondence and Schützenberger’s evacuation of standard tableaux to enumerate permutations and involutions which are invariant under the reverse-complement map and which have no decreasing subsequences of length k. These enumerations are in terms of numbers of permutations with no decreasing subsequences of length approximately k2 ; we use known results co...
متن کاملEnumerating Permutations by their Run Structure
Motivated by a problem in quantum field theory, we study the up and down structure of circular and linear permutations. In particular, we count the length of the (alternating) runs of permutations by representing them as monomials and find that they can always be decomposed into so-called ‘atomic’ permutations introduced in this work. This decomposition allows us to enumerate the (circular) per...
متن کاملEnumerating pairs of permutations with the same up-down form
For each sequence q = {qi} = ±1, i = 1 . . . . . n 1 let Nq = the number of permutations tr of 1, 2 . . . . . n with up-down sequence sgn(tri+x-tri) = th, i = 1 . . . . . n 1. Clearly Y.q (Nqln!) = 1 but what is the probability p, = Y.q (NJn! ) 2 that two random permutations have the same up-down sequence? We show that p,, = ( K " t l , 1) where 1 = l(x, y)-1 and K "-1 is the iterated integral ...
متن کاملBounded gaps between primes
It is proved that lim inf n→∞ (pn+1 − pn) < 7× 10, where pn is the n-th prime. Our method is a refinement of the recent work of Goldston, Pintz and Yildirim on the small gaps between consecutive primes. A major ingredient of the proof is a stronger version of the Bombieri-Vinogradov theorem that is applicable when the moduli are free from large prime divisors only (see Theorem 2 below), but it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111957